Behavioral Experiments for Assessing the Abstract Argumentation Semantics of Reinstatement
نویسندگان
چکیده
Argumentation is a very fertile area of research in Artificial Intelligence, and various semantics have been developed to predict when an argument can be accepted, depending on the abstract structure of its defeaters and defenders. When these semantics make conflicting predictions, theoretical arbitration typically relies on ad hoc examples and normative intuition about what prediction ought to be the correct one. We advocate a complementary, descriptive-experimental method, based on the collection of behavioral data about the way human reasoners handle these critical cases. We report two studies applying this method to the case of reinstatement (both in its simple and floating forms). Results speak for the cognitive plausibility of reinstatement and yet show that it does not yield the full expected recovery of the attacked argument. Furthermore, results show that floating reinstatement yields comparable effects to that of simple reinstatement, thus arguing in favor of preferred argumentation semantics, rather than grounded argumentation semantics. Besides their theoretical value for validating and inspiring argumentation semantics, these results have applied value for developing artificial agents meant to argue with human users.
منابع مشابه
Experiments for Assessing Floating Reinstatement in Argument-based Reasoning
Various Artificial Intelligence semantics have been developed to predict when an argument can be accepted, depending on the abstract structure of its defeaters and defenders. These semantics can make conflicting predictions, as in the situation known as floating reinstatement. We argue that the debate about which semantics makes the correct prediction can be informed by the collection of experi...
متن کاملOn the Issue of Reinstatement in Argumentation
Dung’s theory of abstract argumentation frameworks [8] led to the formalization of various argument-based semantics, which are actually particular forms of dealing with the issue of reinstatement. In this paper, we re-examine the issue of semantics from the perspective of postulates. In particular, we ask ourselves the question of which (minimal) requirements have to be fulfilled by any princip...
متن کاملToward a Computational Analysis of Probabilistic Argumentation Frameworks
In this paper we analyze probabilistic argumentation frameworks (PAFs), defined as an extension of Dung abstract argumentation frameworks in which each argument is asserted with a probability . The debate around PAFs has so far centered on their theoretical definition and basic properties. This work contributes to their computational analysis by proposing a first recursive algorithm to compute ...
متن کاملStage semantics and the SCC-recursive schema for argumentation semantics
Recently, stage and cf2 semantics for abstract argumentation attracted specific attention. By distancing from the notion of defense, they are capable to select arguments out of odd-length cycles. In case of cf2 semantics, the SCC-recursive schema guarantees that important evaluation criteria for argumentation semantics, like directionality, weakand CF -reinstatement, are fulfilled. Beside sever...
متن کاملIncorporating Stage Semantics in the SCC-recursive Schema for Argumentation Semantics
Recently, the stage and cf2 semantics for abstract argumentation attracted specific attention. By distancing from the notion of defense, they are capable to select arguments out of odd-length cycles. Furthermore, the maximality criterion of naive sets ensures reasonable solutions. The SCCrecursive schema, where the cf2 semantics is defined in, guarantees that some specific evaluation criteria, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Cognitive science
دوره 34 8 شماره
صفحات -
تاریخ انتشار 2010